Refining Landauer’s Stack: Balancing Error and Dissipation When Erasing Information
نویسندگان
چکیده
Nonequilibrium information thermodynamics determines the minimum energy dissipation to reliably erase memory under time-symmetric control protocols. We demonstrate that its bounds are tight and so show costs overwhelm those implied by Landauer's bound on erasure. Moreover, in limit of perfect computation, diverge. The conclusion is time-asymmetric protocols should be developed for efficient, accurate thermodynamic computing. And, Stack -- full suite theoretically-predicted ready experimental test calibration.
منابع مشابه
Erasing errors due to alignment ambiguity when estimating positive selection.
Current estimates of diversifying positive selection rely on first having an accurate multiple sequence alignment. Simulation studies have shown that under biologically plausible conditions, relying on a single estimate of the alignment from commonly used alignment software can lead to unacceptably high false-positive rates in detecting diversifying positive selection. We present a novel statis...
متن کاملSpeed, dissipation, and error in kinetic proofreading.
Proofreading mechanisms increase specificity in biochemical reactions by allowing for the dissociation of intermediate complexes. These mechanisms disrupt and reset the reaction to undo errors at the cost of increased time of reaction and free energy expenditure. Here, we draw an analogy between proofreading and microtubule growth which share some of the features described above. Our analogy re...
متن کاملWave-Based Turing Machine: Time Reversal and Information Erasing.
The investigation of dynamical systems has revealed a deep-rooted difference between waves and objects regarding temporal reversibility and particlelike objects. In nondissipative chaos, the dynamic of waves always remains time reversible, unlike that of particles. Here, we explore the dynamics of a wave-particle entity. It consists in a drop bouncing on a vibrated liquid bath, self-propelled a...
متن کاملFinite-time erasing of information stored in fermionic bits.
We address the issue of minimizing the heat generated when erasing the information stored in an array of quantum dots in finite time. We identify the fundamental limitations and trade-offs involved in this process and analyze how a feedback operation can help improve it.
متن کاملRefining the Analysis of Divide and Conquer: How and When
Divide-and-conquer is a central paradigm for the design of algorithms, through which some fundamental computational problems, such as sorting arrays and computing convex hulls, are solved in optimal time within Θ(n logn) in the worst case over instances of size n. A finer analysis of those problems yields complexities within O(n(1 + H(n1, . . . , nk))) ⊆ O(n(1+ log k)) ⊆ O(n logn) in the worst ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 2021
ISSN: ['0022-4715', '1572-9613']
DOI: https://doi.org/10.1007/s10955-021-02733-1